Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Sistema no determinista")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 712

  • Page / 29
Export

Selection :

  • and

Systèmes PARallèles Communicants. Etude du non-déterminisme : comparaison des comportements des processus = Parallel communicating systems. Study of non-determinary: comparison of processes behaviorsROGE, Sylvie.Rapport de recherche - Informatique et mathématiques appliquées de Grenoble, ISSN: 0750-7380 ; 541. 1985, 76 p.Report

A callgraph-based search strategy for automated Performance diagnosis1CAIN, H. W; MILLER, B. P; WYLIE, B. J. N et al.Lecture notes in computer science. 2000, pp 108-122, issn 0302-9743, isbn 3-540-67956-1Conference Paper

Two implementation relations and the correctness of communicating replicated processesKOUTNY, M; MANCINI, L. V; PAPPALARDO, G et al.Formal aspects of computing. 1997, Vol 9, Num 2, pp 119-148, issn 0934-5043Article

Nondeterministic polling systemsSRINIVASAN, M. M.Management science. 1991, Vol 37, Num 6, pp 667-681, issn 0025-1909Article

An algorithm for ensuring fairness and liveness in non-deterministic systems based on multiparty interactionsRUIZ, David; CORCHUELO, Rafael; PEREZ, José A et al.Lecture notes in computer science. 2002, pp 563-572, issn 0302-9743, isbn 3-540-44049-6, 10 p.Conference Paper

On the structure of one-tape nondeterministic turing machine time hierarchyKOBAYASHI, K.Theoretical computer science. 1985, Vol 40, Num 2-3, pp 175-193, issn 0304-3975Article

Canonical prefixes of Petri net unfoldingsKHOMENKO, Victor; KOUTNY, Maciej; VOGLER, Walter et al.Lecture notes in computer science. 2002, pp 582-595, issn 0302-9743, isbn 3-540-43997-8, 14 p.Conference Paper

Choice construct and lindström logicsHOANG, H. K.Lecture notes in computer science. 1999, pp 105-125, issn 0302-9743, isbn 3-540-65922-6Conference Paper

On varieties of density and crossing properties for event structuresKOSTOV, V. E; STARKOVA, S. A; VIRBITSKAITE, I. B et al.Computers and artificial intelligence. 1995, Vol 14, Num 6, pp 611-622, issn 0232-0274Article

Unwinding possibilistic security propertiesMANTEL, Heiko.Lecture notes in computer science. 2000, pp 238-254, issn 0302-9743, isbn 3-540-41031-7Conference Paper

On the semantics of concurrency : partial orders and transition systemsBOUDOL, Gérard; CASTELLANI, Ilaria.Rapport de recherche I.N.R.I.A, ISSN: 0249-6399 ; 550. 1986, 17 p.Report

Some observations on the connection between counting and recursionWAGNER, K. W.Theoretical computer science. 1986, Vol 47, Num 2, pp 131-147, issn 0304-3975Article

Enumeration reducibility with polynomial time boundsHARRIS, Charles M.Lecture notes in computer science. 2006, pp 209-220, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 12 p.Conference Paper

Non-deterministic semantics for paraconsistent C-systemsAVRON, Arnon.Lecture notes in computer science. 2005, pp 625-637, issn 0302-9743, isbn 3-540-27326-3, 13 p.Conference Paper

Nondeterministic dynamics and turbulent transportKUPIAINEN, A.Annales Henri Poincaré. 2003, Vol 4, pp S713-S726, issn 1424-0637, SUP2Article

A transformation technique for datalog programs based on non-deterministic constructsPOTIKAS, Petros; RONDOGIANNIS, Panos; GERGATSOULIS, Manolis et al.Lecture notes in computer science. 2002, pp 25-45, issn 0302-9743, isbn 3-540-43915-3, 21 p.Conference Paper

Finding the shortest path in the shortest time using PCNN's : Special issue on pulse coupled neural networksCAULFIELD, H. J; KINSER, J. M.IEEE transactions on neural networks. 1999, Vol 10, Num 3, pp 604-606, issn 1045-9227Article

Desiderata in agent architectures for coordinating-multi-agent systemsLEE, J.Lecture notes in computer science. 1999, pp 47-60, issn 0302-9743, isbn 3-540-65967-6Conference Paper

Theory and algorithms for state minimization of nondeterministic FSM'sKAM, T; VILLA, T; BRAYTON, R. K et al.IEEE transactions on computer-aided design of integrated circuits and systems. 1997, Vol 16, Num 11, pp 1311-1322, issn 0278-0070Article

On the supremal controllable sublanguage in the discrete-event model of nondeterministic hybrid control systemsXIAOJUN YANG; LEMMON, M. D; ANTSAKLIS, P. J et al.IEEE transactions on automatic control. 1995, Vol 40, Num 12, pp 2098-2103, issn 0018-9286Article

Non-deterministic queue operationsGARCIA-MOLINA, H; SALEM, K.Journal of computer and system sciences (Print). 1995, Vol 51, Num 2, pp 211-222, issn 0022-0000Conference Paper

A methematical approach to nondeterminism in data typesHESSELINK, W. H.ACM transactions on programming languages and systems. 1988, Vol 10, Num 1, pp 87-117, issn 0164-0925Article

Countable nondeterminism and random assignmentAPT, K. R; PLOTKIN, G. D.Journal of the Association for Computing Machinery. 1986, Vol 33, Num 4, pp 724-767, issn 0004-5411Article

Recursive Identification for Stochastic Hammerstein SystemsCHEN, Han-Fu.Block-oriented nonlinear system identification. Lecture notes in control and information sciences. 2010, Vol 404, pp 69-87, issn 0170-8643, isbn 978-1-84996-512-5, 1Vol, 19 p.Book Chapter

Non-deterministic halting times for hamkins-kidder turing machinesWELCH, P. D.Lecture notes in computer science. 2006, pp 571-574, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 4 p.Conference Paper

  • Page / 29